Optimal control for networks with unobservable malicious nodes
نویسندگان
چکیده
Classic network optimization theory focuses on models with stochastic dynamics and all nodes being observable controllable. However, modern systems often offer limited access suffer from adversarial attacks. In this paper, we focus networks unobservable malicious nodes, where the dynamics, such as external arrivals control actions of can be adversarial. We first extend existing by introducing a new maliciousness metric that constrains adversary, characterize stability region under dynamics. then propose an algorithm only operates accessible does not require direct observations show our is stabilizing long are within region. Finally, stabilizes even if estimates state erroneous, necessary sufficient conditions for to stabilizable when subjected estimation errors.
منابع مشابه
IMNTV-Identifying Malicious Nodes using Trust Value in Wireless Sensor Networks
Security is the major area of concern in communication channel. Security is very crucial in wireless sensor networks which are deployed in remote environments. Adversary can disrupt the communication within multi hop sensor networks by launching the attack. The common attacks which disrupt the communication of nodes are packet dropping, packet modification, packet fake routing, badmouthing atta...
متن کاملOn agent-based aggregation schemes in networks with malicious nodes
Mobile agents can be used to efficiently aggregate information in sensor networks. The originator aims at obtaining the correct result, even in the presence of byzantine nodes or a malicious aggregator agent. Secure information aggregation considers these situations. We propose to use a mobile agent for the hierarchical in-network aggregation scheme of Chan et al. and we introduce a greedy stra...
متن کاملComparing Reputation Schemes for Detecting Malicious Nodes in Sensor Networks
Remotely deployed sensor networks are vulnerable to both physical and electronic security breaches. The sensor nodes, once compromised, can send erroneous data to the base station, thereby possibly compromising network effectiveness. We assume that sensor nodes are organized in a hierarchy and use offline neural network based learning technique to predict the data sensed at any node given the d...
متن کاملOptimal broadcasting in networks with faulty nodes
Large computer networks are an essential part of modern technology, and quite often information needs to be broadcast to all the computers in the network. If all computers work perfectly all the time, this is simple. Suppose, however, that some of the computers fail occasionally. What is the fastest way to ensure that with high probability all working computers get the information? In this pape...
متن کاملAsynchronous Throughput-Optimal Routing in Malicious Networks
We demonstrate the feasibility of throughput-efficient routing in a highly unreliable network. Modeling a network as a graph with vertices representing nodes and edges representing the links between them, we consider two forms of unreliability: unpredictable edge-failures, and deliberate deviation from protocol specifications by corrupt nodes. The first form of unpredictability represents netwo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Performance Evaluation
سال: 2021
ISSN: ['0166-5316', '1872-745X']
DOI: https://doi.org/10.1016/j.peva.2021.102230